Modelling deadlock in open restricted queueing networks

Modelling deadlock in open restricted queueing networks

Open restricted queueing networks give rise to the phenomenon of deadlock, whereby some customers may be unable to ever leave a server due to mutual blocking. This paper explores deadlock in queueing networks with limited queueing capacity, presents a method of detecting deadlock in discrete event simulations, and builds Markov chain models of these deadlocking networks. The three networks for ...

Process-Algebraic Modelling of Priority Queueing Networks

We consider a closed multiclass queueing network model in which each class receives a different priority level and jobs with lower priority are served only if there are no higher-priority jobs in the queue. Such systems do not enjoy a product form solution, thus their analysis is typically carried out through approximate mean value analysis (AMVA) techniques. We formalise the problem in PEPA in...

Brownian Approximations of Multiclass Open-Queueing Networks

Analysis of Restricted Queueing Networks - A Blocking Approach

In this paper we consider an open restricted queueing network with Poisson arrivals and exponential service times at stations and present an approximation method for analysis, made by node-by-node decomposition employing the concept of effective arrival rate and effective service rate. The steady state characteristics of the network system and of individual stations are obtained. Congestion due...

The Heavy-traffic Botrleneck Phenomenon in Open Queueing Networks

This note describes a simulation experiment involving nine exponential queues in series with a non-Poisson arrival process, which demonstrates that the heavy-traffic bottleneck phenomenon can occur in practice (at reasonable traffic intensities) as well as in theory (in the limit). The results reveal limitations in customary two-moment approximations for open queueing networks. queues * open qu...